CRYPTANALYSIS OF A DYNAMIC THRESHOLD DECRYPTION SCHEME

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Threshold Decryption Scheme Using Bilinear Pairings

A dynamic threshold sharing scheme is one that allows the set of participants to expand and contract. In this work we discuss dynamic threshold decryption schemes using bilinear pairing. We discuss and analyze existing schemes, demonstrate an attack and construct a significantly more efficient secure scheme.

متن کامل

Construction of Dynamic Threshold Decryption Scheme from Pairing

The first dynamic threshold decryption scheme from pairing is presented. It is secure in groups equipped with a bilinear map, and caters to some important requirements in real application; including the needs to renew the master key, or to add/remove or update a decryption sever, without leaking any information on the master key and changing other decryption servers’ secret keys.

متن کامل

Cryptanalysis of a Threshold Proxy Signature Scheme∗

A (t, n) threshold proxy signature scheme allows t or more proxy signers out of a designated group of n proxy signers to sign messages on behalf of an original signer. Recently, Hwang et al. proposed a new (t, n) threshold proxy signature scheme based on the RSA cryptosystem. In this paper, we show that their scheme is insecure against the original signer’s forgery and the general forgery.

متن کامل

Cryptanalysis to a Certificateless Threshold Signature Scheme

Certificateless public key cryptography is a new paradigm with two interesting features. On one hand, it keeps the certificate free property of identity-based public key cryptography (ID-PKC), while on the other hand, it gets rid of the inherent key escrow problem of ID-PKC. These two distinctive features make certificateless threshold signature schemes more applicable in practice as it removes...

متن کامل

A Provable Security Scheme of ID-Based Threshold Decryption

This paper presents an ID-based threshold decryption scheme and proves that it is selective chosen ciphertext secure without random oracles based on solving decisional BDHI q t − ) , , ( ε problem assumption.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications of the Korean Mathematical Society

سال: 2009

ISSN: 1225-1763

DOI: 10.4134/ckms.2009.24.1.153